package com.klun.project.common.constans.leetcode;

import com.klun.project.common.constans.utils.ParseUtils;

import java.util.List;

//在一个由 '0' 和 '1' 组成的二维矩阵内，找到只包含 '1' 的最大正方形，并返回其面积。
//
// 示例 1：
//输入：matrix = [
// ["1","0","1","0","0"],
// ["1","0","1","1","1"],
// ["1","1","1","1","1"]
//,["1","0","0","1","0"]]
//输出：4
//
// 示例 2：
//输入：matrix = [["0","1"],["1","0"]]
//输出：1
//
// 示例 3：
//输入：matrix = [["0"]]
//输出：0
//
// 提示：
// m == matrix.length
// n == matrix[i].length
// 1 <= m, n <= 300
// matrix[i][j] 为 '0' 或 '1'
// Related Topics 数组 动态规划 矩阵


public class Solution221 {
	// f(i,j,x,y) = m[i][j]...m[i][x] == 1 &&
	// g(i,j) =
	// todo
	// dp(i,j)=min(dp(i−1,j),dp(i−1,j−1),dp(i,j−1))+1
	public int maximalSquare(char[][] matrix) {
		int m = matrix.length;
		int n = matrix[0].length;
		for (int i = 0; i < m; i++) {
			for (int j = 0; j < n; j++) {

			}
		}
		return 0;
	}

	public static void main(String[] args) {
		Solution221 solution = new Solution221();
		List<List<Integer>> arrayLists = ParseUtils.stringToIntLists("[[2],[3,4],[6,5,7],[4,1,8,3]]");
//		System.out.println(solution.rob(new int[]{2, 7, 9, 3, 1}));
	}

}
